Optimal Scheduling and Software Pipelining of Repetitive Signal Flow Graphs with Delay Line Optimization

نویسندگان

  • Francis Depuydt
  • Werner Geurts
  • Gert Goossens
  • Hugo De Man
چکیده

Software pipelining can have an enormous impact on the clock cycle count and hence on the performance of a real-time signal processing design. Because it pays off to invest CPU time in the optimal software pipelining of time-critical parts of a design, an integer programming approach is proposed for simultaneous scheduling and software pipelining. The integer programming techniques in the literature do not support cyclic (repetitive) signalflow graphs, and/or do not allow optimization of the storage cost of delay lines during software pipelining. The new contributions in this paper are the full integration of software pipelining and scheduling, based on a new timing model that supports cyclic signal flow graphs and optimization of delay line storage costs. Experiments with several real-time signal processing applications have shown the practical applicability of the approach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Regular Stream Flow Graphs 42 . 1 Operational Model of Regular Stream Flow

In this paper, we present a novel framework of multi-rate scheduling of signal processing programs represented by regular stream ow graphs (RSFGs). The main contribution of this paper is translating the scheduling problem of RSFGs into an equivalent problem in the domain of Karp-Miller computation graphs. A distinct feature of our scheduling framework | called multi-rate software pipelining | i...

متن کامل

A novel framework for multi-rate scheduling in DSP applications

Net model for ne-grain loop scheduling. [7] S. Ha and E.A. Lee. Compile-time scheduling and assignment of data-BLOCKINow program graphs with data-dependent iteration. [12] K.K. Parhi and D.G. Messerschmitt. Statuc rate-optimal scheduling of iterative data-BLOCKINow programs via optimum unfolding. Direct synthesis of optimized DSP assembly code from signal ow block diagrams. [14] H. Printz. Auto...

متن کامل

Hamiltonian Recurrence for ILP scheduling

Software pipelining has become a very extended loop execution model since microprocessors include more functional units. Scheduling techniques developed for software pipeline a loop have to look for heuristics, thus they achieve the optimal scheduling only in some cases. In this paper we present another software pipelining approach based on a methodology that divides the scheduling problem in t...

متن کامل

Meta heuristic for Minimizing Makespan in a Flow-line Manufacturing Cell with Sequence Dependent Family Setup Times

This paper presents a new mathematical model for the problem of scheduling part families and jobs within each part family in a flow line manufacturing cell where the setup times for each family are sequence dependent and it is desired to minimize the maximum completion time of the last job on the last machine (makespan) while processing parts (jobs) in each family together. Gaining an optimal s...

متن کامل

A Software Pipelining Method Based on a Hierarchical Social Algorithm

Software pipelining is a compile-time scheduling technique that overlaps successive loop iterations to achieve instruction-level parallelism. It allows us to hide memory latency by overlapping the prefetches for a future iteration with the computation of the current iteration. This paper presents an efficient algorithm for determining the iteration bound of cyclic data flow graphs and the optim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994